Fast feature matching based on r ‐nearest k ‐means searching
نویسندگان
چکیده
منابع مشابه
Fast k-means based on KNN Graph
In the era of big data, k-means clustering has been widely adopted as a basic processing tool in various contexts. However, its computational cost could be prohibitively high as the data size and the cluster number are large. It is well known that the processing bottleneck of k-means lies in the operation of seeking closest centroid in each iteration. In this paper, a novel solution towards the...
متن کاملFast k nearest neighbour search for R-tree family
A simpliied k nearest neighbour (knn) search for the R-tree 6] family is proposed in this paper. This method is modiied from the technique developed by Roussopoulos et al. 10]. The main approach aims to eliminate redundant searches when the data is highly correlated. We also describe how MINMAXDIST calculations can be avoided using MINDIST as the only distance metric which gives a signiicant sp...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملFast Shape-Based Nearest-Neighbor Search for Brain MRIs Using Hierarchical Feature Matching
This paper presents a fast method for quantifying shape differences/similarities between pairs of magnetic resonance (MR) brain images. Most shape comparisons in the literature require some kind of deformable registration or identification of exact correspondences. The proposed approach relies on an optimal matching of a large collection of features, using a very fast, hierarchical method from ...
متن کاملKernel Penalized K-means: A feature selection method based on Kernel K-means
Article history: Received 11 June 2014 Received in revised form 23 October 2014 Accepted 11 June 2015 Available online 19 June 2015
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CAAI Transactions on Intelligence Technology
سال: 2018
ISSN: 2468-2322,2468-2322
DOI: 10.1049/trit.2018.1041